31 research outputs found

    Test scenarios generation for a class of processes defined in the BPEL language

    Get PDF
    The main purpose of this research is adaptation of critical paths method [1] to the processes defined in BPEL. The critical path method is the specification based and simulation oriented method. In the paper it is show that under some assumptions the BPEL process may be considered as an embedded system, in which tasks are like services and communication between tasks is like coordination of the services according to the task graph of the system. An example is given where a set of test scenarios is presented

    Fault-tolerant control for Scalable Distributed Data Structures

    Get PDF
    calable Distributed Data Structures (SDDS) can be applied for multicomputers. Multicomputers were developed as a response to market demand for scalable and dependable but not expensive systems. SDDS consists of two components dynamically spread across a multicomputer: records belonging to a file and a mechanism controlling record placement in the file. Methods of making records of the file more or less fault-tolerant have already been given. Methods of making the mechanism controlling record placement in the file fault-tolerant have not been studied, yet, although it seems that this is more important for the system dependability than record fault tolerance. Faults in control may lead an application to crash, while record data faults may cause invalid computations at most. In the paper a fault-tolerant control for SDDS is given. It is based on an application of Job Comparison Technique along with TMR. Time overhead due to redundancy introduced is estimated, too

    RT-level fast fault simulator

    Get PDF
    In this paper a new fast fault simulation technique is presented for calculation of fault propagation through HLPs (High Level Primitives). ROTDDs (Reduced Ordered Ternary Decision Diagrams) are used to describe HLP modules. The technique is implemented in the HTDD RT-level fault simulator. The simulator is evaluated with some ITC99 benchmarks. A hypothesis is proved that a test set coverage of physical failures can be anticipated with high accuracy when RTL fault model takes into account optimization strategies that are used in CAE system applied

    Fault tolerant control for RP* architecture of Scalable Distributed Data Structures

    Get PDF
    Scalable Distributed Data Structures consist of two components dynamically spread across amulticomputer: records belonging to a file and a mechanism controlling record placement in thefile space. Record (data) faults may lead to invalid computations at most, while record placementfaults may bring whole file to crash. In this paper, extended SDDS RP* (Range Partitioning)architecture tolerant to the latter faults is presented and evaluated

    Resource Allocation Optimization in Critical Chain Method

    Get PDF
    The paper presents resource allocation optimization in Critical Chain Project Management (CCPM). The cheapest project schedule is searched with respect to time constraints. The algorithm originally developed for the hardware-software co-design of heterogeneous distributed systems is adapted to work with human resources and CCPM method. The results of the optimization showed significant efficiency of the algorithm in comparison with a greedy algorithm. On average, the optimization gives 14.10% of cost reduction using the same number of resources. The gain varies depending on the number of resources and the time constraints. Advantages and disadvantages of such an approach are also discussed

    Validation of reactive embedded systems against specification requirements

    Get PDF
    In this paper a method of automatic generation of test scenarios for verification of specification requirements (temporal and functional) for reactive embedded systems is presented

    Detecting changes in environment of mobile robot

    Get PDF
    The usefulness of four signature schemes for detecting changes in environment of mobile robot is investigated. Computational and memory complexities of software implementations of the schemes are experimentally compared. Finally, the best of the schemes for considered application is chosen

    How validation can help in testing business processes orchestrating web services

    Get PDF
    Validation and testing are important in developing correct and fault free SOA-basedsystems. BPEL is a high level language that makes it possible to implement business processes asan orchestration of web services. In general, the testing requires much more test scenarios than thevalidation. However, in the case of BPEL processes, which have very simple and well structuredimplementation, test scenarios limited to the validation may also be efficient. The paper describes anexperiment that aims at answering a question whether or not the validation test scenarios are alsoadequate for testing an implementation of BPEL processes. The experiment employs a Software FaultInjector for BPEL Processes that is able to inject faults when the test scenarios are running. Theresults of the experiment seem very promising. Hence, it seems that validation tests might give astrong support for testing

    A procedure of verification of comprehensive tests for selection of candidates for operators of mobile robot

    Get PDF
    This paper presents a part of research concerning an application of virtual reality for training operators of mobile robots (mobots). Mobots are often used for exploring areas dangerous or hardly accessible. It is obvious that the operator should not be a common person. In the paper a procedure of verification of comprehensive tests such as IQ test for initial selection of candidates for mobot operators is given and evaluated

    Experimental data driven robot for pattern classification

    Get PDF
    In this paper the problem whether or not a human being can plan a tour for a mobile robot with a camera so that all changes in the room are detected within a time limit is investigated. A tour simulator and a game based on it are developed. The plan of the winner of the game is used for a driving real robot. It is shown that this plan is two times shorter (as Java bytecode for Lego RCX) than the average one
    corecore